Splittable and unsplittable graphs and configurations
نویسندگان
چکیده
منابع مشابه
On splittable colorings of graphs and hypergraphs
The notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this paper, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two-round game played against an adversary. We show that the techniques used and bounds obtained on the extremal (r,m)-split coloring problem...
متن کاملOn splittable and unsplittable flow capacitated network design arc-set polyhedra
We study the polyhedra of splittable and unsplittable single arc–set relaxations of multicommodity flow capacitated network design problems. We investigate the optimization problems over these sets and the separation and lifting problems of valid inequalities for them. In particular, we give a linear–time separation algorithm for the residual capacity inequalities [19] and show that the separat...
متن کاملMathematical Programming Manuscript No. on Splittable and Unsplittable Ow Capacitated Network Design Arc{set Polyhedra
We study the polyhedra of splittable and unsplittable single arc{set relaxations of multicommodity ow capacitated network design problems. We investigate the optimization problems over these sets and the separation and lifting problems of valid inequalities for them. In particular, we give a linear{time separation algorithm for the residual capacity inequalities 19] and show that the separation...
متن کاملOn Splittable and Unsplittable Ow Capacitated Network Design Arc{set Polyhedra
We study the polyhedra of splittable and unsplittable arc sets of multicommodity ow capac-itated network design problems. We investigate the optimization problems over these polyhedra and the separation and lifting problems of valid inequalities for them. In particular, we give a linear-time separation algorithm for the residual capacity inequalities (Magnanti et al., 1993) and show that the se...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2018
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.1467.04b